Relating the Bounded Arithmetic and Polynomial Time Hierarchies
نویسنده
چکیده
The bounded arithmetic theory S 2 is nitely axiomatized if and only if the polynomial hierarchy provably collapses. If T i 2 equals S i+1 2 then T i 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to p i+3 , and, in fact, to the Boolean hierarchy over p i+2 and to p i+1 =poly .
منابع مشابه
On Parallel Hierarchies and Rik
This paper de nes natural hierarchies of function and relation classes, constructed from parallel complexity classes in a manner analogous to the polynomial-time hierarchy. A number of structural results about these classes are proven: relationships between them and the levels of PH; relationships between these classes and de nability in the bounded arithmetic theoriesR k; and several results r...
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملThe polynomial and linear time hierarchies in V0
We show that the bounded arithmetic theory V does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some auxiliary input; we derive this from a theorem of Ajtai.
متن کاملBounded Queries to SAT and the
We study the complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number of queries to an NP oracle. Depending on whether we allow some queries to depend on the results of other queries, we obtain two (probably) diierent hierarchies. We present several results relating the bounded NP query hierarchies to each other and to the Boolean hierar...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 75 شماره
صفحات -
تاریخ انتشار 1995